SOME BOUNDS OF THE COMPLEXITY OF PREDICATE RECOGNITION BY FINITE AUTOMATA.BREITBART Y.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 12; NO 3; PP. 336-349; BIBL. 4 REF.Article

TIME-SIZE TRADEOFFS FOR RECOGNITION OF COMPLETE SETS (PRELIMINARY REPORT)BREITBART Y; LEWIS FD.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 192-195; BIBL. 8 REF.Conference Paper

ANALYSIS OF ALGORITHMS FOR THE EVALUATION OF MONOTONIC BOOLEAN FUNCTIONSBREITBART Y; GAL S.1978; I.E.E.E. TRANS COMPUTERS; USA; DA. 1978; VOL. 27; NO 11; PP. 1083-1087; BIBL. 11 REF.Article

OPTIMAL SEQUENTIAL ARRANGEMENT OF EVALUATION TREES FOR BOOLEAN FUNCTIONS.PERL Y; BREITBART Y.1976; INFORM. SCI.; U.S.A.; DA. 1976; VOL. 11; NO 1; PP. 1-12; BIBL. 3 REF.Article

COMBINED COMPLEXITY. A NEW DIRECTION IN COMPUTATIONAL COMPLEXITY.BREITBART Y; LEWIS FD.sdIN: CONF. INF. SCI. SYST. PROC.; BALTIMORE, MD.; 1977; BALTIMORE; JOHNS HOPKINS UNIV.; DA. S.D.; PP. 1-5; BIBL. 16 REF.Conference Paper

COMBINED COMPLEXITY CLASSES FOR FINITE-FUNCTIONSBREITBART Y; LEWIS FD.1979; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1979; VOL. 13; NO 1; PP. 87-97; BIBL. 19 REF.Article

ALGORITHMS FOR FAST EVALUATION OF BOOLEAN EXPRESSIONS.BREITBART Y; REITER A.1975; ACTA INFORMAT.; ALLEM.; DA. 1975; VOL. 4; NO 2; PP. 107-116; BIBL. 5 REF.Article

COMPLEX PROPERTIES OF GRAMMARSABRAMSON FG; BREITBART Y; LEWIS FD et al.1980; J. ASS. COMPUTG MACHIN.; USA; DA. 1980; VOL. 27; NO 3; PP. 484-498; BIBL. 18 REF.Article

Automaticity I : Properties of a measure of descriptional complexitySHALLIT, J; BREITBART, Y.Journal of computer and system sciences (Print). 1996, Vol 53, Num 1, pp 10-25, issn 0022-0000Article

On the size of binary decision diagrams representing Boolean functionsBREITBART, Y; HUNT, H. III; ROSENKRANTZ, D et al.Theoretical computer science. 1995, Vol 145, Num 1-2, pp 45-69, issn 0304-3975Article

Unifying concurrency control and recovery of transactionsALONSO, G; VINGRALEK, R; AGRAWAL, D et al.Information systems (Oxford). 1994, Vol 19, Num 1, pp 101-115, issn 0306-4379Conference Paper